WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(7, 7)
  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(2, 0)
  "0" :: [] -(0)-> "A"(14, 7)
  "false" :: [] -(0)-> "A"(0, 0)
  "if" :: ["A"(0, 0) x "A"(7, 7) x "A"(7, 7)] -(1)-> "A"(7, 7)
  "le" :: ["A"(0, 0) x "A"(2, 0)] -(1)-> "A"(0, 0)
  "minus" :: ["A"(7, 7) x "A"(14, 7)] -(1)-> "A"(7, 7)
  "p" :: ["A"(7, 7)] -(1)-> "A"(14, 7)
  "s" :: ["A"(14, 7)] -(7)-> "A"(7, 7)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "s" :: ["A"(2, 0)] -(2)-> "A"(2, 0)
  "s" :: ["A"(21, 7)] -(14)-> "A"(14, 7)
  "true" :: [] -(0)-> "A"(0, 0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "false" :: [] -(0)-> "A"_cf(1, 1)
  "false" :: [] -(0)-> "A"_cf(0, 0)
  "if" :: ["A"_cf(0, 0) x "A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "le" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(0, 0)
  "le" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "minus" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "p" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "true" :: [] -(0)-> "A"_cf(1, 1)
  "true" :: [] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------